Shape recognition from large image libraries by inexact graph matching
نویسندگان
چکیده
This paper describes a graph-matching technique for recognising line-pattern shapes in large image databases. The methodological contribution of the paper is to develop a Bayesian matching algorithm that uses edge-consistency and node attribute similarity. This information is used to determine the a posteriori probability of a query graph for each of the candidate matches in the database. The node feature-vectors are constructed by computing normalised histograms of pairwise geometric attributes. Attribute similarity is assessed by computing the Bhattacharyya distance between the histograms. Recognition is realised by selecting the candidate from the database which has the largest a posteriori probability. Ó 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Sensitivity Analysis for Graph Matching from Large Structural Libraries
The problem of retrieving a graph from a large structural data-base the most closely resembles a query is a task of pivotal importance. For instance the recognition of relational descriptions of line-patterns is central to the manipulation of large data-bases of both CAD models and structural representations of pictorial shape. From a practical standpoint the di culty stems from the fact that t...
متن کاملInexact graph matching using a genetic algorithm for image recognition
Exact graph matching using a genetic algorithm for image recognition has been introduced in previously published work. The algorithm was based on angle matching between two given graphs. It has proven to be quite effective in exact graph matching. However, the algorithm needs some modifications in order to handle cases where the number of nodes, shapes and rotations of the two graphs are differ...
متن کاملShape Retrieval by Inexact Graph Matching
This paper describes a graph-matching technique for recognising line-pattern shapes in large image databases. The methodological contribution of the paper is to develop a Bayesian matching algorithm that uses edge-consistency and node attribute similarity. This information is used to determine the a posteriori probability of a query graph for each of the candidate matches in the database. The n...
متن کاملRecognition of User-Defined Video Object Models using Weighted Graph Homomorphisms
In this paper, we propose a new system for video object detection based on user-defined models. Object models are described by “model graphs” in which nodes represent image regions and edges denote spatial proximity. Each node is attributed with color and shape information about the corresponding image region. Model graphs are specified manually based on a sample image of the object. Object rec...
متن کاملInexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms
A method for segmentation and recognition of image structures based on graph homomorphisms is presented in this paper. It is a model-based recognition method where the input image is over-segmented and the obtained regions are represented by an attributed relational graph (ARG). This graph is then matched against a model graph thus accomplishing the model-based recognition task. This type of pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition Letters
دوره 20 شماره
صفحات -
تاریخ انتشار 1999